Nonlinear Lagrange Dual for Multi-Objective Programming Problems
نویسنده
چکیده
In this paper nonlinear Lagrange dual for a nonlinear multi-objective programming problem is formulated and it is proved that pareto optimal solution of the primal multi-objective programming problem and optimal solution of its nonlinear Lagrange dual are equal. Mathematics Subject Classification: 90C26, 90C39, 90C46
منابع مشابه
A Compromise Decision-Making Model Based on TOPSIS and VIKOR for Multi-Objective Large- Scale Nonlinear Programming Problems with A Block Angular Structure under Fuzzy Environment
This paper proposes a compromise model, based on a new method, to solve the multiobjectivelarge scale linear programming (MOLSLP) problems with block angular structureinvolving fuzzy parameters. The problem involves fuzzy parameters in the objectivefunctions and constraints. In this compromise programming method, two concepts areconsidered simultaneously. First of them is that the optimal alter...
متن کاملA Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Nonlinear Programming
This paper presents an algorithm for solving multi-stage stochastic convex non-linear programs. The algorithm is based on the Lagrangian dual method which relaxes the nonanticipativity constraints, and the barrier function method which enhances the smoothness of the dual objective function so that the Newton search directions can be used. The algorithm is shown to be of global convergence and o...
متن کاملStudy on multi-objective nonlinear programming in optimization of the rough interval constraints
This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems. All of the lower and upper approximatio...
متن کاملLagrangian Dual Method With Self-Concordant Barriers for Multi-Stage Stochastic Nonlinear Programming
This paper presents an algorithm for solving multi-stage stochastic nonlinear programs. The algorithm is based on the Lagrangian dual method which relaxes the nonanticipa-tivity constraints, and the barrier function method which enhances the smoothness of the dual objective function so that the Newton search directions can be used. The algorithm is shown to be of globally linear convergence and...
متن کاملSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کامل